منابع مشابه
Diffusing Polygons and Sle(κ, Ρ)
We give a geometric derivation of SLE(κ, ρ) in terms of con-formally invariant random growing compact subsets of polygons. The parameters ρ j are related to the exterior angles of the polygons. We also show that SLE(κ, ρ) can be generated by a metric Brownian motion , where metric and Brownian motion are coupled and the metric is a pull-back metric of the Euclidean metric of an evolving polygon.
متن کاملGuarding Fat Polygons and Triangulating Guarded Polygons
In this paper we study three related problems: (i) Given a fat polygon P , we show how to find a set G of points in P such that every point on the boundary of P sees at least one point of G. The set G is said to guard the boundary of P and its cardinality depends on the shape parameters of P . Fat polygons are often used to model more realistic inputs. (ii) Given k points that guard the boundar...
متن کاملCapture of the Lamb: Diffusing Predators Seeking a Diffusing Prey
What is the survival probability of a diffusing lamb which is hunted by N hungry lions? Although this capture process is appealingly simple to define ~see Fig. 1!, its long-time behavior poses a theoretical challenge because of the delicate interplay between the positions of the lamb and the closest lion. This model also illustrates a general feature of nonequilibrium statistical mechanics: lif...
متن کاملDissections of Polygons into Convex Polygons
In the paper we present purely combinatorial conditions that allow us to recognize the topological equivalence (or non-equivalence) of two given dissections. Using a computer program based on this result, we are able to generate a set which contains all topologically non-equivalent dissections of a p0-gon into convex pi-gons, i = 1, ..., n, where n, p0, ..., pn are integers such that n ≥ 2, pi ...
متن کاملConvexity of Sub-polygons of Convex Polygons
A convex polygon is defined as a sequence (V0, . . . , Vn−1) of points on a plane such that the union of the edges [V0, V1], . . . , [Vn−2, Vn−1], [Vn−1, V0] coincides with the boundary of the convex hull of the set of vertices {V0, . . . , Vn−1}. It is proved that all sub-polygons of any convex polygon with distinct vertices are convex. It is also proved that, if all sub-(n − 1)-gons of an n-g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 2006
ISSN: 0019-2082
DOI: 10.1215/ijm/1258059471